Search results for "Solution concept"
showing 4 items of 4 documents
The Results of Changing the Current Solution Concept of Universal Motor Gear Reducers with Helical Gears
2021
By analysing and comparing the existing solutions of universal gear reducers with helical gears of the leading manufacturers, it can be noticed the effort to increase the load capacity of the gear reducer within the same axis height. In this way, the manufacturers can offer smaller (cheaper) gear reducers, as well as to simultaneously increase the values of the largest gear ratios. This concept enables the offer of lower-stage (cheaper) gear reducers with higher gear ratios in certain segments of gear ratios. By these efforts, it is reached the maximum, but the further increase is possible only by changing the current concept of universal gear drives. Within this paper, it is given an overv…
Noncooperative dynamic games for inventory applications: A consensus approach
2008
We focus on a finite horizon noncooperative dynamic game where the stage cost of a single player associated to a decision is a monotonically nonincreasing function of the total number of players making the same decision. For the single-stage version of the game, we characterize Nash equilibria and derive a consensus protocol that makes the players converge to the unique Pareto optimal Nash equilibrium. Such an equilibrium guarantees the interests of the players and is also social optimal in the set of Nash equilibria. For the multi-stage version of the game, we present an algorithm that converges to Nash equilibria, unfortunately not necessarily Pareto optimal. The algorithm returns a seque…
Introspection and equilibrium selection in 2 � 2 matrix games
1994
Game theory lacks an explanation of how players' beliefs are formed and why they are in equilibrium. This is the reason why it has failed to make significant advances with the problem of equilibrium selection even for quite siniple games, as 2x2 games with two strict Nash equilibria. Our paper models the introspection process by which the selected equilibrium is achieved in this class of games. Players begin their analysis with imprecise priors, obtained under weak restrictions formulated as Axioms. For a large class of reasoning dynamics we obtain as the solution the risk dominant Nash equilibrium.
Consensus in Noncooperative Dynamic Games: a Multi-Retailer Inventory Application
2008
We focus on Nash equilibria and Pareto optimal Nash equilibria for a finite horizon noncooperative dynamic game with a special structure of the stage cost. We study the existence of these solutions by proving that the game is a potential game. For the single-stage version of the game, we characterize the aforementioned solutions and derive a consensus protocol that makes the players converge to the unique Pareto optimal Nash equilibrium. Such an equilibrium guarantees the interests of the players and is also social optimal in the set of Nash equilibria. For the multistage version of the game, we present an algorithm that converges to Nash equilibria, unfortunately, not necessarily Pareto op…